Diagnosis of Heart Disease Based on Meta Heuristic Algorithms and Clustering Methods

نویسندگان

  • Hamid Reza Ghaffary Islamic Azad University, Ferdows Branch, ferdows, Iran.
  • Sadaf Roostaee Islamic Azad University, Ferdows Branch, ferdows, Iran.
چکیده مقاله:

Data analysis in cardiovascular diseases is difficult due to large massive of information. All of features are not impressive in the final results. So it is very important to identify more effective features. In this study, the method of feature selection with binary cuckoo optimization algorithm is implemented to reduce property. According to the results, the most appropriate classification for support vector machine is featured diagnoses heart disease. The main purpose of this article is feature reduction and providing a more precise diagnosis of the disease. The proposed method is evaluated using three measures: accuracy, sensitivity and specificity. For comparison, a data set of Machine Learning Repository database including information about 303 people with 14 features was used. In addition to the high accuracy of current methods, are expensive and time-consuming. The results indicate that the proposed method is superior on other algorithms in terms of Performance, accuracy and run time.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A hybrid meta-heuristic algorithm based on ABC and Firefly algorithms

Abstract— In this paper we have tried to develop an altered version of the artificial bee colony algorithm which is inspired from and combined with the meta-heuristic algorithm of firefly. In this method, we have tried to change the main equation of searching within the original ABC algorithm. On this basis, a new combined equation was used for steps of employed bees and onlooker bees. For this...

متن کامل

Improving the Performance of Machine Learning Algorithms for Heart Disease Diagnosis by Optimizing Data and Features

Heart is one of the most important members of the body, and heart disease is the major cause of death in the world and Iran. This is why the early/on time diagnosis is one of the significant basics for preventing and reducing deaths of this disease. So far, many studies have been done on heart disease with the aim of prediction, diagnosis, and treatment. However, most of them have been mostly f...

متن کامل

Clustering and Memory-based Parent-Child Swarm Meta-heuristic Algorithm for Dynamic Optimization

So far, various optimization methods have been proposed, and swarm intelligence algorithms have gathered a lot of attention by academia. However, most of the recent optimization problems in the real world have a dynamic nature. Thus, an optimization algorithm is required to solve the problems in dynamic environments well. In this paper, a novel collective optimization algorithm, namely the Clus...

متن کامل

Two Strategies Based on Meta-Heuristic Algorithms for Parallel Row Ordering Problem (PROP)

Proper arrangement of facility layout is a key issue in management that influences efficiency and the profitability of the manufacturing systems. Parallel Row Ordering Problem (PROP) is a special case of facility layout problem and consists of looking for the best location of n facilities while similar facilities (facilities which has some characteristics in common) should be arranged in a row ...

متن کامل

Spectral and meta-heuristic algorithms for software clustering

When large software systems are reverse engineered, one of the views that is produced is the system decomposition hierarchy. This hierarchy shows the system’s subsystems, the contents of the subsystems (i.e., modules or other subsystems), and so on. Software clustering tools create the system decomposition automatically or semi-automatically with the aid of the software engineer. The Bunch soft...

متن کامل

Comparison of Meta-Heuristic Algorithms for Clustering Rectangles

In this paper we consider a simplified version of the stock cutting (two-dimensional bin packing) problem. We compare three meta-heuristic algorithms (genetic algorithm (GA), tabu search (TS) and simulated annealing (SA)) when applied to this problem. The results show that tabu search and simulated annealing produce good quality results. This is not the case with the genetic algorithm. The prob...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 4  شماره 2

صفحات  105- 110

تاریخ انتشار 2016-12-01

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023